Encryption scheme based on expanded Reed-Solomon codes

We present a code-based public-key cryptosystem, in which we use Reed-Solomon codes over an extension field as secret and disguise it by considering its shortened expanded code the base field. Considering provides safeguard against distinguisher attacks based on Schur product. Moreover, without using cyclic or quasi-cyclic structure obtain key size reduction of nearly \begin{document}$ 45 \% $\end{document} compared to classic {McE}liece cryptosystem proposed Bernstein et al.